Generating RSA Moduli with a Predetermined Portion
نویسنده
چکیده
This paper reviews and generalizes a method to generate RSAmoduli with a predetermined portion. The potential advantages of the resultingmethods are discussed: both the storage and the computational requirements ofthe RSA cryptosystem can be considerably reduced. The constructions are as ef-ficient as generation of regular RSA moduli, and the resulting moduli do notseem to offer less security than regular RSA moduli.
منابع مشابه
RSA Moduli with a Predetermined Portion: Techniques and Applications
This paper discusses methods for generating RSA moduli with a predetermined portion. Predetermining a portion enables to represent RSA moduli in a compressed way, which gives rise to reduced transmissionand storage requirements. The first method described in this paper achieves the compression rate of known methods but is fully compatible with the fastest prime generation algorithms available o...
متن کاملMolecular Dynamics Investigation of The Elastic Constants and Moduli of Single Walled Carbon Nanotubes
Determination of the mechanical properties of carbon nanotubes is an essential step in their applications from macroscopic composites to nano-electro-mechanical systems. In this paper we report the results of a series of molecular dynamics simulations carried out to predict the elastic constants, i.e. the elements of the stiffness tensor, and the elastic moduli, namely the Young’s and shear mod...
متن کاملHashing solutions instead of generating problems: On the interactive certification of RSA moduli
Certain RSA-based protocols, for instance in the domain of group signatures, require a prover to convince a verifier that a set of RSA parameters is well-structured (e.g., that the modulus is the product of two distinct primes and that the exponent is co-prime to the group order). Various corresponding proof systems have been proposed in the past, with different levels of generality, efficiency...
متن کاملFast Generation of Prime Numbers and
A very eecient recursive algorithm for generating nearly random prov-able primes is presented. The expected time for generating a prime is only slightly greater than the expected time required for generating a pseudo-prime of the same size that passes the Miller-Rabin test for only one base. Therefore our algorithm is even faster than presently-used algorithms for generating only pseudo-primes ...
متن کاملDigitally Watermarking RSA Moduli
The moduli used in RSA (see [5]) can be generated by many different sources. The generator of that modulus knows its factorization. They have the ability to forge signatures or break any system based on this moduli. If a moduli and the RSA parameters associated with it were generated by a reputable source, the system would have higher value than if the parameters were generated by an unknown en...
متن کامل